An integrated access tree construction and tree encryption to improve the encryption/decryption efficiency

This work proposes a useful Ciphertext-Policy Attribute-Based Hierarchical archive grouping Encryption plan named CP-ABHE. By sensible, we infer that CP-ABHE is progressively powerful in both calculation and additional room without surrendering information security. In CP-ABHE, we initially build up a ton of composed access trees subject to the chronicles' attribute sets. We use the insatiable procedure to create the trees bit by bit and build up the trees capably by joining the little ones. By then, all the reports on an organized access tree are encoded together. Particular to existing plans, the leaves in different access trees with a comparative trademark offer a comparable mystery number, which is used to scramble the archives. This fundamentally improves the presentation of CP-ABHE. The security of our arrangement is speculatively exhibited subject to the decisional bilinear Diffine Hellman supposition

A novel SSGK to protect the communication process and shared data from unauthorized access

A cloud-based big data sharing system uses a storage facility from a cloud specialist co-op to impart data to authentic clients. As opposed to customary arrangements, cloud supplier stores the mutual data in the huge server farms outside the trust area of the data proprietor, which may trigger the issue of data classification. This paper proposes a secret sharing group key management convention (SSGK) to secure the correspondence procedure and shared data from unapproved get to. Not quite the same as the earlier works, a shared key is utilized to encode the common data and a secret sharing plan is utilized to circulate the shared key in SSGK. The broad security and execution investigations demonstrate that our convention profoundly limits the security and protection dangers of sharing data in distributed storage and spares about 12% of extra storage space

Improve query response time and reduce CPU cost in web search

We suggest the Predictive Energy Saving Online Scheduling Algorithm (PESOS) to choice the greatest suitable CPU frequency to procedure a query on a per-core basis. PESOS goal at procedure queries by their limits, and leverage high-level preparation info to decrease the CPU energy ingesting of a query dispensation node. PESOS base its result on inquiry efficacy predictors, guessing the meting out volume and meting out time of a query. We experimentally gauge PESOS upon the TREC ClueWeb09B collection and the MSN2006 query log. PESOS outpace also the best state-of-the-art entrant with a 20% oomph saving, while the player requires a fine restriction fine-tuning and it may invite in wild potential abuses

Efficient and Secure Routing In Network Layer For MANET

Secure routing and communication security protocols can be combined and applied on the messages to deliver them with complete shielding. The custom of communication security protocols initially advanced for wire line and Wi-Fi networks can also present a heavy burden on the limited network resources of a MANET. To discourse these issues, a novel secure framework (SUPERMAN) was projected. The basis is planned to consent existing network and routing protocols to complete their functions, while providing node authentication, access control, and communication security mechanisms. In this work we present innovative security framework for MANETs, SUPERMAN. Recreation results comparing SUPERMAN with IPsec, SAODV and SOLSR are provided to determine the suggested frameworks correctness for wireless communication security